class Solution {
public:
    int jumpFloorII(int number) {
        int dp[number];
        int i;
        dp[1]=1;
        dp[2]=2;
        for(i=3;i<=number;i++)
        {
            dp[i]=dp[i-1]*2;
        }
        return dp[number];
    }
};